0c58c8846e243844c9c793cd04da32623870a8cc,community/src/main/java/org/neo4j/graphalgo/impl/path/ExactDepthPathFinder.java,ExactDepthPathFinder,paths,#Node#Node#,68
Before Change
} );
int firstHalf = onDepth / 2;
Traverser startTraverser = base.prune( TraversalFactory.pruneAfterDepth( firstHalf ) )
.expand( expander ).traverse( start );
Traverser endTraverser = base.prune( TraversalFactory.pruneAfterDepth( onDepth-firstHalf ) )
.expand( expander.reversed() ).traverse( end );
final Iterator<Position> startIterator = startTraverser.iterator();
final Iterator<Position> endIterator = endTraverser.iterator();
final Map<Node, Map<Integer, Visit>> visits = new HashMap<Node, Map<Integer,Visit>>();
visits.put( start, MapUtil.<Integer, Visit>genericMap( 0,
new Visit( startIterator.next(), startIterator) ) );
visits.put( end, MapUtil.<Integer, Visit>genericMap( 0,
new Visit( endIterator.next(), endIterator) ) );
return new PrefetchingIterator<Path>()
{
@Override
After Change
} );
final int firstHalf = onDepth / 2;
Traverser startTraverser = base.prune(
TraversalFactory.pruneAfterDepth( firstHalf ) ).expand(
expander ).filter( new Predicate<Position>()
{
public boolean accept( Position item )
{
return item.depth() == firstHalf;
}
} ).traverse( start );
final int secondHalf = onDepth - firstHalf;
Traverser endTraverser = base.prune(
TraversalFactory.pruneAfterDepth( secondHalf ) ).expand(
expander.reversed() ).filter( new Predicate<Position>()
{
public boolean accept( Position item )
{
return item.depth() == secondHalf;
}
} ).traverse( end );
final Iterator<Position> startIterator = startTraverser.iterator();
final Iterator<Position> endIterator = endTraverser.iterator();